A behavioural pseudometric for probabilistic transition systems
نویسندگان
چکیده
منابع مشابه
A behavioural pseudometric for probabilistic transition systems
Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Bor...
متن کاملApproximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue of probabilistic bisimilarity. Distance zero captures probabilistic bisimilarity. Each pseudometric has a discount factor, a real number in the interval (0, 1]. The smaller the discount factor, the more the future is ...
متن کاملA pseudometric in supervisory control of probabilistic discrete event systems
The focus of this paper is the pseudometric used as a key concept in our previous work on optimal supervisory control of probabilistic discrete event systems. The pseudometric is employed to measure the behavioural similarity between probabilistic systems, and initially was defined as a greatest fixed point of a monotone function. This paper further characterizes the pseudometric. First, it giv...
متن کاملBehavioural Pseudometrics for Nondeterministic Probabilistic Systems
For the model of probabilistic labelled transition systems that allow for the co-existence of nondeterminism and probabilities, we present two notions of bisimulation metrics: one is state-based and the other is distribution-based. We provide a sound and complete modal characterisation for each of them, using real-valued modal logics based on Hennessy-Milner logic. The logic for characterising ...
متن کاملA Decomposition Theorem for Probabilistic Transition Systems
In this paper we prove that every nite Markov chain can be de composed into a cascade product of a Bernoulli process and several simple permutation reset deterministic automata The original chain is a state homomorphic image of the product By doing so we give a positive answer to an open question stated in Paz concerning the decomposability of probabilistic systems Our result is based on the ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.09.035